Computing Approximate Extended Krylov Subspaces without Explicit Inversion

It will be shown that extended Krylov subspaces –under some assumptions– can be retrieved without any explicit inversion or system solves involved. Instead we do the necessary computations of A−1v in an implicit way using the information from an enlarged standard Krylov subspace. It is well-known that both for classical and extended Krylov spaces, direct unitary similarity transformations exist providing us the matrix of recurrences. In practice, however, for large dimensions computing time is saved by making use of iterative procedures to gradually gather the recurrences in a matrix. Unfortunately, for extended Krylov spaces one is required to frequently solve, in some way or another a system of equations. In this article both techniques will be integrated. We start with an orthogonal basis of a standard Krylov subspace of dimension m+m+ p. Then we will apply a unitary similarity built by rotations compressing thereby significantly the initial subspace and resulting in an orthogonal basis approximately spanning the extended Krylov subspace Km,m(A, v) = span { A−m+1v, · · · , A−1v, v, Av,Av, . . . , Am−1 } . Numerical experiments support our claims that this approximation is very good if the large Krylov subspace contains { A−m+1v, · · · , A−1v } and thus can culminate in nonneglectable dimensionality reduction and as such also can lead to time savings when approximating, e.g., matrix functions.